A Coinduction Principle for Recursive Data Types Based on Bisimulation
نویسنده
چکیده
Synopsis The concept of bisimulation from concurrency theory Par81, Mil89] is used to reason about recursively deened data types. From two strong-extensionality theorems stating that the equality (resp. inequality) relation is maximal among all bisimulations, a proof principle for the nal coalgebra of an endofunctor on a category of data types (resp. domains) is obtained. As an application of the theory developed, an internal full abstraction result (in the sense of AO93]) for the ca-nonical model of the untyped call-by-value-calculus is proved. Also, the operational notion of bisimulation and the denotational notion of nal semantics are related by means of conditions under which both coincide.
منابع مشابه
Coiterative Morphisms: Interactive Equational Reasoning for Bisimulation, using Coalgebras
We study several techniques for interactive equational reasoning with the bisimulation equivalence. Our work is based on a modular library, formalised in Coq , that axiomatises weakly final coalgebras and bisimulation. As a theory we derive some coalgebraic schemes and an associated coinduction principle. This will help in interactive proofs by coinduction, modular derivation of congruence and ...
متن کاملGeneralized Coinduction
We introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor F. Parameterised by T and λ it generalizes the basic coiteration schema uniquely characterising functions into a final F-coalgebra. Furthermore, the same parameters are used to generalize the categorical notion of a bisimulation to that of a λ-bisimulation, still giving rise to a proof technique for bis...
متن کاملGeneralised Coinduction
Final coalgebras of a functor F are suited for an abstract description of infinite datatypes and dynamical systems. Functions into such a domain are specified by coinductive definitions. The format these specifications take when their justification is directly based on finality is called the coiteration schema here. In applications it often turns out to be too rigid to allow for a convenient de...
متن کاملA Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are complete with respect to the notion of “recursive type equality” on a restricted class of recursive types in μ-term notation. Here we show the existence of an immediate duality with a geometrical visualization between...
متن کاملCoinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via simulation and bisimulation, respectively. The main novelty of the axiomatization is the fixpoint rule (or coinduction principle), which has the f...
متن کامل